Coarse Geometry and Randomness
نویسنده
چکیده
1 Introductory graph and metric notions 5 1.1 The Cheeger constant . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 1.2 Expander graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 1.3 Isoperimetric dimension . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 1.4 Separation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 1.5 Rough isometry . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 1.6 Ends . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 1.7 Graph growth and the Cheeger constant . . . . . . . . . . . . . . . . . . 12 1.8 Scale invariant graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 1.9 Examples of graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16
منابع مشابه
REVERSE LOOP SUBDIVISION FOR GEOMETRY AND TEXTURES
Reverse subdivision aims at constructing a coarser representation of an object given by a fine polygon mesh. In this paper, we first derive a mask for reverse Loop subdivision that can be applied to both regular and extraordinary vertices. The mask is parameterized, and thus can also be used in reversing variants of Loop subdivision, such as those proposed by Warren and Litke. We apply this mas...
متن کاملThe Boltzmann Entropy and Randomness Tests
In the context of the dynamical systems of classical mechanics, we introduce two new notions called “algorithmic fine-grain and coarse-grain entropy”. The fine-grain algorithmic entropy is, on the one hand, a simple variant of the randomness tests of MartinLöf (and others) and is, on the other hand, a connecting link between description (Kolmogorov) complexity, Gibbs entropy and Boltzmann entro...
متن کاملCoarse Reducibility and Algorithmic Randomness
A coarse description of a set A ⊆ ω is a set D ⊆ ω such that the symmetric difference of A and D has asymptotic density 0. We study the extent to which noncomputable information can be effectively recovered from all coarse descriptions of a given set A, especially when A is effectively random in some sense. We show that if A is 1-random and B is computable from every coarse description D of A, ...
متن کاملFolding and Design in Coarse-Grained Protein Models
Recent advances in coarse-grained lattice and off-lattice protein models are reviewed. The sequence dependence of thermodynamical folding properties are investigated and evidence for non-randomness of the binary sequences of good folders are discussed. Similar patterns for non-randomness are found for real proteins. Dynamical parameter MC methods, such as the tempering and multisequence algorit...
متن کاملDynamic Multilevel Graph Visualization
We adapt multilevel, force-directed graph layout techniques to visualizing dynamic graphs in which vertices and edges are added and removed in an online fashion (i.e., unpredictably). We maintain multiple levels of coarseness using a dynamic, randomized coarsening algorithm. To ensure the vertices follow smooth trajectories, we employ dynamics simulation techniques, treating the vertices as poi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013